On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product
نویسندگان
چکیده
منابع مشابه
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give an O(n)-space and O(1)-time delay algorithm that enumerates all biconnected rooted outerplanar gra...
متن کاملThe k-path vertex cover of rooted product graphs
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...
متن کاملA Note on Tensor Product of Graphs
Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.
متن کاملOn the metric dimension of corona product graphs
For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)) where d(x, y) represents the distance between the vertices x and y. The set W is called a resolving set for G if every vertex of G has a distinct representation. A resolving set containing...
متن کاملOn Rooted Directed Path Graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three of them is an asteroidal triple. Two non adjacent vertices are linked by a special connection if either they have a common neighbor or they are the endpoints of two vertex-dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2018
ISSN: 2227-7390
DOI: 10.3390/math6100191